An Inequality Involving the Local Eigenvalues of a Distance-Regular Graph

نویسنده

  • PAUL TERWILLIGER
چکیده

Let denote a distance-regular graph with diameter D ≥ 3, valency k, and intersection numbers ai , bi , ci . Let X denote the vertex set of and fix x ∈ X . Let denote the vertex-subgraph of induced on the set of vertices in X adjacent x . Observe has k vertices and is regular with valency a1. Let η1 ≥ η2 ≥ · · · ≥ ηk denote the eigenvalues of and observe η1 = a1. Let denote the set of distinct scalars among η2, η3, . . . , ηk . For η ∈ let multη denote the number of times η appears among η2, η3, . . . , ηk . Let λ denote an indeterminate, and let p0, p1, . . . , pD denote the polynomials in R[λ] satisfying p0 = 1 and λpi = ci+1 pi+1 + (ai − ci+1 + ci )pi + bi pi−1 (0 ≤ i ≤ D − 1), where p−1 = 0. We show 1 + ∑ η∈ η =−1 pi−1(η̃) pi (η̃)(1 + η̃) multη ≤ k bi (1 ≤ i ≤ D − 1), where we abbreviate η̃ = −1−b1(1+η)−1. Concerning the case of equality we obtain the following result. Let T = T (x) denote the subalgebra of MatX (C) generated by A, E∗ 0 , E ∗ 1 , . . . , E ∗ D , where A denotes the adjacency matrix of and E∗ i denotes the projection onto the i th subconstituent of with respect to x . T is called the subconstituent algebra or the Terwilliger algebra. An irreducible T -module W is said to be thin whenever dimE∗ i W ≤ 1 for 0 ≤ i ≤ D. By the endpoint of W we mean min{i |E∗ i W = 0}. We show the following are equivalent: (i) Equality holds in the above inequality for 1 ≤ i ≤ D − 1; (ii) Equality holds in the above inequality for i = D − 1; (iii) Every irreducible T -module with endpoint 1 is thin.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

D-Spectrum and D-Energy of Complements of Iterated Line Graphs of Regular Graphs

The D-eigenvalues {µ1,…,µp} of a graph G are the eigenvalues of its distance matrix D and form its D-spectrum. The D-energy, ED(G) of G is given by ED (G) =∑i=1p |µi|. Two non cospectral graphs with respect to D are said to be D-equi energetic if they have the same D-energy. In this paper we show that if G is an r-regular graph on p vertices with 2r ≤ p - 1, then the complements of iterated lin...

متن کامل

On Q-Polynomial Association Schemes of Small Class

We show an inequality involving the third largest or second smallest dual eigenvalues of Q-polynomial association schemes of class at least three. Also we characterize dual-tight Q-polynomial association schemes of class three. Our method is based on tridiagonal matrices and can be applied to distance-regular graphs as well.

متن کامل

Some Results on the Eigenvalues of Distance-Regular Graphs

In 1986, Terwilliger showed that there is a strong relation between the eigenvalues of a distance-regular graph and the eigenvalues of a local graph. In particular, he showed that the eigenvalues of a local graph are bounded in terms of the eigenvalues of a distance-regular graph, and he also showed that if an eigenvalue θ of the distance-regular graph has multiplicity m less than its valency k...

متن کامل

On the distance eigenvalues of Cayley graphs

In this paper, we determine the distance matrix and its characteristic polynomial of a Cayley graph over a group G in terms of irreducible representations of G. We give exact formulas for n-prisms, hexagonal torus network and cubic Cayley graphs over abelian groups. We construct an innite family of distance integral Cayley graphs. Also we prove that a nite abelian group G admits a connected...

متن کامل

TIGHT DISTANCE - REGULAR GRAPHSAleksandar

We consider a distance-regular graph ? with diameter d 3 and eigenvalues k = 0 > 1 > > d. We show the intersection numbers a 1 ; b 1 satisfy (a 1 + 1) 2 : We say ? is tight whenever ? is not bipartite, and equality holds above. We characterize the tight property in a number of ways. For example, we show ? is tight if and only if the intersection numbers are given by certain rational expressions...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004